Intersecting families of sets, no l containing two common elements
نویسندگان
چکیده
منابع مشابه
Intersecting families of sets, no l containing two common elements
Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...
متن کاملMultiply intersecting families of sets
Let [n] denote the set {1, 2, ..., n}, 2 the collection of all subsets of [n] and F ⊂ 2 be a family. The maximum of |F| is studied if any r subsets have an at least s-element intersection and there are no ` subsets containing t+1 common elements. We show that |F| ≤ Pt−s i=0 n−s i + t+`−s t+2−s n−s t+1−s + `− 2 and this bound is asymptotically the best possible as n →∞ and t ≥ 2s ≥ 2, r, ` ≥ 2 a...
متن کاملIntersecting Balanced Families of Sets
Suppose that any t members (t ≥ 2) of a regular family on an n element set have at least k common elements. It is proved that the largest member of the family has at least k1/tn1−1/t elements. The same holds for balanced families, which is a generalization of the regularity. The estimate is asymptotically sharp.
متن کاملAlmost Intersecting Families of Sets
Let us write DF (G) = {F ∈ F : F ∩ G = ∅} for a set G and a family F . Then a family F of sets is said to be (≤ l)-almost intersecting (l-almost intersecting) if for any F ∈ F we have |DF (F )| ≤ l (|DF (F )| = l). In this paper we investigate the problem of finding the maximum size of an (≤ l)almost intersecting (l-almost intersecting) family F . AMS Subject Classification: 05D05
متن کاملIntersecting Families of Separated Sets
A set A ⊆ {1, 2, . . . , n} is said to be k-separated if, when considered on the circle, any two elements of A are separated by a gap of size at least k. We prove a conjecture due to Holroyd and Johnson [3],[4] that an analogue of the Erdős-Ko-Rado theorem holds for k-separated sets. In particular the result holds for the vertex-critical subgraph of the Kneser graph identified by Schrijver [7],...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00131-x